Buffer sizing results for RCP congestion control under connection arrivals and departures
نویسندگان
چکیده
منابع مشابه
Simulation of File Arrivals and Departures on Buffer sizing in Access Routers
Most of the contemporary systems assumes that all the flow of packets are same and requires O(1) buffer size for transferring packets in a network. This leads to more buffer size even for short flow of packets also, which wastes the buffer size. To overcome this problem, this paper proposes a new technique which uses different buffer sizes based on the packet flows. For long packet flows longer...
متن کاملScheduling in Wireless Networks with Connection Arrivals and Departures
We consider wireless ad hoc networks in which each connection (file) traverses only one hop. We assume that files arrive for service at each link and a file departs when all its packets have been transmitted. The file size distribution can be arbitrary, but the file sizes are assumed to be bounded. We assume that a window flow control protocol regulates the injection of packets from each file i...
متن کاملRCP-AC: Congestion control to make flows
We believe that a congestion control algorithm should make flows finish quickly as quickly as possible, while staying stable and fair among flows. Recently, we proposed RCP (Rate Control Protocol) which enables typical Internet-sized flows to complete one to two orders of magnitude faster than the existing (TCP Reno) and the proposed (XCP) congestion control algorithm. Like XCP, RCP uses explic...
متن کاملConvergence of trajectories and optimal buffer sizing for AIMD congestion control
We study the interaction between the AIMD (Additive Increase Multiplicative Decrease) multi-socket congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic hybrid models. First, we show that trajectories always converge to limiting cycles. We characterize the cycles. Necessary and sufficient conditions for the absence of multipl...
متن کاملConvergence and Optimal Buffer Sizing for Window Based AIMD Congestion Control
We study the interaction between the AIMD (Additive Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic hybrid models. First, we show that the hybrid model for the interaction between the AIMD congestion control and bottleneck router always converges to a cyclic behavior. We characterize th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 2008
ISSN: 0146-4833
DOI: 10.1145/1496091.1496093